Linked lists

Results: 67



#Item
21Information and Software Technology–1439  Contents lists available at ScienceDirect Information and Software Technology journal homepage: www.elsevier.com/locate/infsof

Information and Software Technology–1439 Contents lists available at ScienceDirect Information and Software Technology journal homepage: www.elsevier.com/locate/infsof

Add to Reading List

Source URL: welf.se

Language: English - Date: 2013-04-23 05:49:36
22Statically Typed Trees in GCC Nathan Sidwell CodeSourcery, LLC Zachary Weinberg CodeSourcery, LLC

Statically Typed Trees in GCC Nathan Sidwell CodeSourcery, LLC Zachary Weinberg CodeSourcery, LLC

Add to Reading List

Source URL: gcc.cybermirror.org

Language: English - Date: 2004-08-29 18:00:00
23Algorithms  Lecture 10: Treaps and Skip Lists [Fa’13] I thought the following four [rules] would be enough, provided that I made a firm and constant resolution not to fail even once in the observance of them. The first

Algorithms Lecture 10: Treaps and Skip Lists [Fa’13] I thought the following four [rules] would be enough, provided that I made a firm and constant resolution not to fail even once in the observance of them. The first

Add to Reading List

Source URL: web.engr.illinois.edu

Language: English - Date: 2014-12-28 09:02:34
24

PDF Document

Add to Reading List

Source URL: homes.cs.washington.edu

Language: English - Date: 2014-08-13 19:26:59
25Concurrent Cache-Oblivious B-Trees Michael A. Bender Jeremy T. Fineman  Department of Computer Science

Concurrent Cache-Oblivious B-Trees Michael A. Bender Jeremy T. Fineman Department of Computer Science

Add to Reading List

Source URL: www.comp.nus.edu.sg

Language: English - Date: 2007-09-28 06:21:01
26Concurrent Tries with Efficient Non-Blocking Snapshots Aleksandar Prokopec EPFL   Nathan G. Bronson

Concurrent Tries with Efficient Non-Blocking Snapshots Aleksandar Prokopec EPFL Nathan G. Bronson

Add to Reading List

Source URL: lampwww.epfl.ch

Language: English - Date: 2011-12-21 05:00:43
27Subtext: Uncovering the Simplicity of Programming

Subtext: Uncovering the Simplicity of Programming

Add to Reading List

Source URL: www.subtext-lang.org

Language: English - Date: 2013-09-04 17:58:55
28A Provably Correct Scalable Concurrent Skip List Maurice Herlihy1,2 , Yossi Lev1,2 , Victor Luchangco2 , and Nir Shavit2 1 2

A Provably Correct Scalable Concurrent Skip List Maurice Herlihy1,2 , Yossi Lev1,2 , Victor Luchangco2 , and Nir Shavit2 1 2

Add to Reading List

Source URL: www.cs.tau.ac.il

Language: English - Date: 2007-02-18 04:19:12
29Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as

Skip Lists: A Probabilistic Alternative to Balanced Trees Skip lists are a data structure that can be used in place of balanced trees. Skip lists use probabilistic balancing rather than strictly enforced balancing and as

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2006-05-29 09:55:51
30COMS21103  Skip lists and other search structures Ashley Montanaro  Department of Computer Science, University of Bristol

COMS21103 Skip lists and other search structures Ashley Montanaro Department of Computer Science, University of Bristol

Add to Reading List

Source URL: www.cs.bris.ac.uk

Language: English - Date: 2014-01-08 09:09:08